منابع مشابه
Multi-Agent Only Knowing
Levesque introduced a notion of “only knowing”, with the goal of capturing certain types of nonmonotonic reasoning. Levesque’s logic dealt with only the case of a single agent. Recently, both Halpern and Lakemeyer independently attempted to extend Levesque’s logic to the multi-agent case. Although there are a number of similarities in their approaches, there are some significant differences. In...
متن کاملMulti-Agent Only-Knowing Revisited
Levesque introduced the notion of only-knowing to precisely capture the beliefs of a knowledge base. He also showed how only-knowing can be used to formalize non-monotonic behavior within a monotonic logic. Despite its appeal, all attempts to extend only-knowing to the many agent case have undesirable properties. A belief model by Halpern and Lakemeyer, for instance, appeals to proof-theoretic ...
متن کاملExplorer Multi - Agent Only - Knowing Revisited
Levesque introduced the notion of only-knowing to precisely capture the beliefs of a knowledge base. He also showed how only-knowing can be used to formalize non-monotonic behavior within a monotonic logic. Despite its appeal, all attempts to extend only-knowing to the many agent case have undesirable properties. A belief model by Halpern and Lakemeyer, for instance, appeals to proof-theoretic ...
متن کاملMulti-Agent Only Knowing on Planet Kripke
The idea of only knowing is a natural and intuitive notion to precisely capture the beliefs of a knowledge base. However, an extension to the many agent case, as would be needed in many applications, has been shown to be far from straightforward. For example, previous Kripke frame-based accounts appeal to proof-theoretic constructions like canonical models, while more recent works in the area a...
متن کاملSemantics for multi-agent only knowing: extended abstract
The paper presents a Kripke semantics for a multi-agent generalization of Levesque’s logic of “only knowing”. We prove soundness and completeness and show that the logic has the Finite model property. The logic satisfies a Modal reduction theorem to the effect that any complex syntactical representation can be syntactically reduced to a provably equivalent form which directly reflects all the m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic and Computation
سال: 2001
ISSN: 0955-792X,1465-363X
DOI: 10.1093/logcom/11.1.41